A bookkeeping strategy for multiple objective linear programs

This paper discusses the bookkeeping strategies for solving large multiple objective linear programs (MOLPs) on ADBASE, a well developed sequential software package, and on a parallel ADBASE algorithm. Three representative list creation schemes were rst analyzed and tested. The best of them, Binary Search with Insertion Sort (BSIS), was selected to be incorporated into ADBASE and the parallel ADBASE algorithm. The resulting new bookkeeping strategy was then tested in ADBASE as well as implemented in the parallel ADBASE algorithm. The parallel implementations were carried out on an Intel Paragon multiprocessor. Computational results show that the new bookkeeping strategy for maintaining a list of e cient solutions signi cantly speeds up the process of solving MOLPs, especially on parallel computers. This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-19480 while the second author was in residence at the Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23681.